Time Quantum based CPU Scheduling Algorithm
نویسندگان
چکیده
منابع مشابه
Fuzzy Priority CPU Scheduling Algorithm
There are several CPU scheduling algorithms like FCFS, SRTN,RR , priority etc. Scheduling decision of these algorithms are based on parameters which are assumed to be crisp. However, in many circumstances these parameters are vague. The vagueness of these parameters suggests that scheduler should use fuzzy logic in scheduling the jobs. A fuzzy priority CPU scheduling algorithm has been proposed...
متن کاملFinding Time Quantum of round Robin Cpu Scheduling Algorithm in General Computing Systems Using Integer Programming
In Round Robin Scheduling, the time quantum is fixed and then processes are scheduled such that no process get CPU time more than one time quantum in one go. If time quantum is too large, the response time of the processes is too much which may not be tolerated in interactive environment. If time quantum is too small, it causes unnecessarily frequent context switch leading to more overheads res...
متن کاملAn Improved CPU Scheduling Algorithm
In multiprogramming systems i.e. in systems where several processes reside in memory, organization of processes is very important so that CPU always has one to execute. CPU scheduling is the base of multiprogramming operating systems. CPU executes one process at a time and switches between processes to improve CPU utilization. CPU scheduling strategies help in selecting the next process to be e...
متن کاملAn optimized round robin cpu scheduling algorithm with dynamic time quantum
CPU scheduling is one of the most crucial operations performed by operating system. Different algorithms are available for CPU scheduling amongst them RR (Round Robin) is considered as optimal in time shared environment. The effectiveness of Round Robin completely depends on the choice of time quantum. In this paper a new CPU scheduling algorithm has been proposed, named as DABRR (Dynamic Avera...
متن کاملComparison of Performance of RR CPU Scheduling Algorithm with Different Dynamic CPU Scheduling Algorithm
Round Robin CPU scheduling algorithm use fixed time quantum in timeshared system. In timeshared system performance is totally depends upon the selection of time quantum. Static time quantum and selection of time quantum both reason in RR CPU scheduling algorithm is disadvantage for the CPU performance. In this paper study the different dynamic RR CPU scheduling algorithm and discuss the selecti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2014
ISSN: 0975-8887
DOI: 10.5120/17167-7235